More Facts that Isomorphism Cannot Explain
نویسندگان
چکیده
We would like to thank Eva Dobler, Marc Garellek, Michelle St-Amour and Eva Sokol for their help in conducting the experiments. We also thank the children, administrators and parents at Children’s Corner, CPE McGill, Playskool, SSMU and YMCA Westmount daycares in Montreal and at the Scuola Materna S.Benedetto in Siena, where the experiments have been conducted. The research reported in this paper was partially funded by a McGill VP-Internal research grant and a grant from McGill’s Arts Undergraduate Society. Andrea Gualmini is currently supported by a VIDI fellowship from the Netherlands Organization for Scientific Research (NWO) and Utrecht University.
منابع مشابه
Going (More) Public: Institutional Isomorphism and Ownership Reform among Chinese Firms. ()
Publicly traded Chinese firms recently reformed their ownership structures by converting non-tradable shares, which constituted two-thirds of shares outstanding and were held largely by the state, into shares that could trade on domestic exchanges. To facilitate this reform, tradable shareholders were compensated with stock grants from non-tradable shareholders. Our analysis focuses on the leve...
متن کاملGroups and Ultra-groups
In this paper, in addition to some elementary facts about the ultra-groups, which their structure based on the properties of the transversal of a subgroup of a group, we focus on the relation between a group and an ultra-group. It is verified that every group is an ultra-group, but the converse is not true generally. We present the conditions under which, for every normal subultra-group of an u...
متن کاملThe Undeflated Domain of Semantics
It is, I suppose, a truism that an adequate theory of meaning for a natural language L will associate each sentence of L with its meaning. But the converse does not hold. A theory that associates each sentence with its meaning is not, by virtue of that fact, an adequate theory of meaning. For it is also a truism that a semantic theory should explain the (interesting and explicable) semantic fac...
متن کاملWhen Subgraph Isomorphism is Really Hard, and Why This Matters for Graph Databases
The subgraph isomorphism problem involves deciding whether a copy of a pattern graph occurs inside a larger target graph. The non-induced version allows extra edges in the target, whilst the induced version does not. Although both variants are NP-complete, algorithms inspired by constraint programming can operate comfortably on many real-world problem instances with thousands of vertices. Howev...
متن کاملThe isomorphism problem for circulant graphs via Schur ring theory
This paper concerns the applications of Schur ring theory to the isomorphism problem of circulant graphs (Cayley graphs over cyclic groups). A digest of the most important facts about Schur rings presented in the first sections provides the reader with agentie self-eontained introduction to this area. The developed machinery allows us to give proofs of two eonjectures (Zibin' 1975 and Toida 197...
متن کامل